Optimal allocation design without transfers PRELIMINARY DRAFT
نویسندگان
چکیده
This paper studies the allocation of goods to agents without monetary transfers and incomplete information. Agents’ have private, multi-dimensional utilities over goods, drawn from commonly known priors, possibly asymmetric across agents’ types. Both cardinal and ordinal mechanisms are studied. For tractability, a large market approximation is considered with a continuum of agents for each type. We characterize incentive compatible mechanisms that are Pareto-optimal with respect to each type. For general objective functions, this allows reducing the mechanism design problem to a well-defined optimization problem with a few continuous variables. We apply this framework to real data from Boston 2012-2013 school choice reform. The goal is to design an optimal ordinal mechanism to assign students to public schools to maximize a linear combination of utilitarian and max-min welfare, subject to capacity and transportation constraints. We show how to optimally solve a large market model with over 868 types of students and 77 schools, translate the solution into the finite market setup and yield a feasible solution, which significantly outperforms the baseline plan chosen by the city in terms of efficiency, equity, and predictability.
منابع مشابه
Incentive Compatible Transfers
In a quasi-linear environment we characterize the boundaries of the set of transfers which implement a given allocation rule (extremal transfers). Doing so allows us to generalize and unify several existing results of the mechanism design literature. More specifically, our approach delivers a characterization result for the set of implementable allocation rules. Second, we obtain an exact chara...
متن کاملCardinal Bayesian allocation mechanisms without transfers
In allocating goods with no use of monetary transfers, random allocation mechanisms can be designed in order to elicit information on preference intensities. I study the nontransfer allocation of two ex-ante identical objects under Bayesian incentive compatibility, with symmetric agents and independent private valuations. I nd the ex-ante utilitarian-optimal mechanism, in which the probability...
متن کاملA unified framework for distributed video rate allocation over wireless networks
When multiple video streams share a wireless network, careful rate allocation is needed to prevent congestion, as well as to balance the video qualities among the competing streams. In this paper, we present a unified optimization framework for video rate allocation over wireless networks. Our framework applies to both unicast and multicast sessions, and accommodates both scalable and nonscalab...
متن کاملCompetitive Repeated Allocation without Payments
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) incentive compatible mechanisms that do not rely on payments, with the goal of maximizing expected social welfare. We first focus on the case of two agents. We introduce an artificial payment system, which enables us to ...
متن کاملOptimal Resource Allocation in Socio-Ecological Systems: Implications for Sustainability in Kenyan Rangelands*
This paper explores resource allocation decisions in Kenyan rangelands. We analyse choice decision of the producer to enter or not to enter livestock production, and the optimal herd size that is expected to yield maximum benefits to the herder. We apply the Heckman two-stage estimation procedure to correct for selectivity bias in the livestock production, optimal income and optimal herd size p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014